On the covering of pairs by quadruples
نویسنده
چکیده
منابع مشابه
ON RELATIVE CENTRAL EXTENSIONS AND COVERING PAIRS
Let (G;N) be a pair of groups. In this article, first we con-struct a relative central extension for the pair (G;N) such that specialtypes of covering pair of (G;N) are homomorphic image of it. Second, weshow that every perfect pair admits at least one covering pair. Finally,among extending some properties of perfect groups to perfect pairs, wecharacterize covering pairs of a perfect pair (G;N)...
متن کاملHub Covering Location Problem Considering Queuing and Capacity Constraints
In this paper, a hub covering location problem is considered. Hubs, which are the most congested part of a network, are modeled as M/M/C queuing system and located in placeswhere the entrance flows are more than a predetermined value.A fuzzy constraint is considered in order to limit the transportation time between all origin-destination pairs in the network.On modeling, a nonlinear mathematica...
متن کاملMaximal Resolvable Packings and Minimal Resolvable Coverings of Triples by Quadruples
Determination of maximal resolvable packing number and minimal resolvable covering number is a fundamental problem in designs theory. In this article, we investigate the existence of maximal resolvable packings of triples by quadruples of order v (MRPQS(v)) and minimal resolvable coverings of triples by quadruples of order v (MRCQS(v)). We show that an MRPQS(v) (MRCQS(v)) with the number of blo...
متن کاملThe Impact of the Spectral Filter Bandwidth on the Spectral Entanglement and Indistinguishability of Photon Pairs of SPDC Process
In this paper, we have investigated the dependence of the spectral entanglement and indistinguishability of photon pairs produced by the spontaneous parametric down-conversion (SPDC) procedure on the bandwidth of spectral filters used in the detection setup. The SPDC is a three-wave mixing process which occurs in a nonlinear crystal and generates entangled photon pairs and utilizes as one of th...
متن کاملModular Sequences and Modular Hadamard Matrices
For every n divisible by 4, we construct a square matrix H of size n, with coeecients 1, such that H H t nI mod 32. This solves the 32-modular version of the classical Hadamard conjecture. We also determine the set of lengths of 16-modular Golay sequences. 0. Introduction Hadamard matrices can be constructed from various binary sequences, either from Golay complementary sequences, or Williamson...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 61 شماره
صفحات -
تاریخ انتشار 1986